A computational attack on the conjectures of Graffiti: New counterexamples and proofs
نویسندگان
چکیده
Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approximately 200 of the Graffiti conjectures and have found counterexamples for over 40 of them. For each conjecture that failed we display a counterexample. We also provide results that came from analyzing those conjectures which had a small number of counterexamples. Finally, we prove some results about four of the conjectures.
منابع مشابه
Some new families of definite polynomials and the composition conjectures
The planar polynomial vector fields with a center at the origin can be written as an scalar differential equation, for example Abel equation. If the coefficients of an Abel equation satisfy the composition condition, then the Abel equation has a center at the origin. Also the composition condition is sufficient for vanishing the first order moments of the coefficients. The composition conjectur...
متن کاملA computational model of Lakatos-style reasoning
Lakatos outlined a theory of mathematical discovery and justification, which suggests ways in which concepts, conjectures and proofs gradually evolve via interaction between mathematicians. Different mathematicians may have different interpretations of a conjecture, examples or counterexamples of it, and beliefs regarding its value or theoremhood. Through discussion, concepts are refined and co...
متن کاملGraffiti.pc: A Variant of Graffiti
Graffiti.pc is a new conjecture-making program, whose design was influenced by the well-known conjecture making program, Graffiti. This paper addresses the motivation for developing the new program and a description, which includes a comparison to the program, Graffiti. The subsequent sections describe the form of conjectures and educational applications of Graffiti.pc to undergraduate research...
متن کاملSpanning Trees with Many Leaves and Average Distance
In this paper we prove several new lower bounds on the maximum number of leaves of a spanning tree of a graph related to its order, independence number, local independence number, and the maximum order of a bipartite subgraph. These new lower bounds were conjectured by the program Graffiti.pc, a variant of the program Graffiti. We use two of these results to give two partial resolutions of conj...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 147 شماره
صفحات -
تاریخ انتشار 1995